To Infinity and Beyond
نویسنده
چکیده
Computer algebra systems (CAS) are sometimes expected to compute with infinities symbolically. Since operations on such objects do not always conform to a sufficient and consistent set of rules for ordinary arithmetic, some compromises are necessary. We discuss a few options and implementations.
منابع مشابه
An approach to rank efficient DMUs in DEA based on combining Manhattan and infinity norms
In many applications, discrimination among decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA). The DEA models unable to discriminate between extremely efficient DMUs. Hence, there is a growing interest in improving discrimination power in DEA yet. The aim of this paper is ranking extreme efficient DMUs in DEA based on exp...
متن کاملINCLUSION RELATIONS CONCERNING WEAKLY ALMOST PERIODIC FUNCTIONS AND FUNCTIONS VANISHING AT INFINITY
We consider the space of weakly almost periodic functions on a transformation semigroup (S, X , ?) and show that if X is a locally compact noncompact uniform space, and ? is a separately continuous, separately proper, and equicontinuous action of S on X, then every continuous function on X, vanishing at infinity is weakly almost periodic. We also use a number of diverse examples to show ...
متن کاملRanking efficient DMUs using the infinity norm and virtual inefficient DMU in DEA
In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The purpose of this paper is ra...
متن کامل